problem n. 1.問題,課題;疑難問題;令人困惑的情況。 2.【數(shù)、物】習題;作圖題。 3.(象棋的)布局問題。 the problem of unemployment 失業(yè)問題。 His whole conduct is a problem to me. 他的一切行為我都不理解。 adj. 1.成問題的;難處理的。 2.關于社會問題的。 a problem child 【心理學】問題兒童;難管教的孩子。 a problem novel [play] (反映社會問題等的)問題小說[戲劇]。 sleep on [upon, over] a problem 把問題留到第二天解決。
This paper studies a pole placement problem for single input discrete systems which can be translated into the diagonal shape 摘要著重研究了一類可化為對角線規(guī)范形的單輸入離散線性定常系統(tǒng)的極點配置問題,得出一個新的計算狀態(tài)反饋矩陣的公式。
From an algebraic approach, the decentralized pole placement problem and robust servomechanism problem were explored; from a geometric approach, the problem of elimination of decentralized fixed modes via time-varying decentralized control was explored 從代數(shù)角度出發(fā),研究了一般真有理系統(tǒng)的分散極點配置問題和魯棒跟隨問題;從幾何角度出發(fā),研究了利用時變分散反饋消除分散固定模的問題。
This fact implies that the fractal algorithm is very effective and in practical . 2 ) by combining the tabu search and the clustering technique, we propose a hybird algorithm to solve the placement problems, both for the bbl and the gate-array placement . simulation results show that our hybird algorithm is of robustness and effectiveness, it is expected the algorithm is also uesful in other optimization problems . to testify the feasibility of using various computational intelligent algorithm, such as neural networks, genetic algorithm and ant colony system approach in solving a 2)首次將禁忌搜索算法與結群技術相結合,并將其分別應用于門陣列布局和bbl布局中,計算機模擬結果表明該算法魯棒性強、有效,適應性廣,適用于大規(guī)模門陣列布局和bbl布局問題,3)分別用神經(jīng)網(wǎng)絡技術、遺傳算法和蟻群算法對兩端線網(wǎng)布線問題進行了研究,并對結果進行了分析比較。
Abstract : an algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells ic design . due to the limitation of computing complexity, an effective and efficient initial placement is very important for detailed placement . novelty of this algorithm lies in a better solution at initial stage by using network-flow method to satisfy row capacity constraint and the thought of linear placement problem ( lpp ) to resolve overlaps . moreover, divide-and-conquer strategy and other simplified methods are adopted to minimize complexity . experimental results show that the algorithm can get an average of 16 wire length improvement on paflo in reasonable cpu time 文摘:以大規(guī)?;旌夏J讲季謫栴}為背景,提出了有效的初始詳細布局算法.在大規(guī)?;旌夏J讲季謫栴}中,由于受到計算復雜性的限制,有效的初始布局算法顯得非常重要.該算法采用網(wǎng)絡流方法來滿足行容量約束,采用線性布局策略解決單元重疊問題.同時,為解決大規(guī)模設計問題,整體上采用分治策略和簡化策略,有效地控制問題的規(guī)模,以時間開銷的少量增加換取線長的明顯改善.實驗結果表明該算法能夠取得比較好的效果,平均比paflo算法有16的線長改善,而cpu計算時間只有少量增加